Positional Games
نویسنده
چکیده
Course number: 0366.4991. Course webpage: www.math.tau.ac.il/∼krivelev/teaching/PosGames/PG.html When and where: Wednesdays 15-18, Schreiber 007 Prospective audience: the course is intended for graduate and advanced undergraduate students in Mathematics and Computer Science. Informal prerequisites: working knowledge of graph theory notions; knowledge of basic concepts in probability. Grading: Home assignments will be given roughly every other week, and their solutions will be graded.
منابع مشابه
Games Where You Can Play Optimally Without Any Memory
Reactive systems are often modelled as two person antagonistic games where one player represents the system while his adversary represents the environment. Undoubtedly, the most popular games in this context are parity games and their cousins (Rabin, Streett and Muller games). Recently however also games with other types of payments, like discounted or mean-payoff [5,6], previously used only in...
متن کاملMarkov Decision Processes and Determining Nash Equilibria for Stochastic Positional Games
A class of stochastic positional games which extend the cyclic games and Markov decision problems with average and discounted optimization costs criteria is formulated and studied. Nash equilibria conditions for considered class of stochastic positional games are derived and some approaches for determining Nash equilibria are described.
متن کاملEnergy Structure of Optimal Positional Strategies in Mean Payoff Games
This paper studies structural aspects concerning optimal positional strategies in Mean Payoff Games, it is a contribution to understanding the relationship between optimal positional strategies in MPGs and small energy-progress measures in reweighted energy games. It is proved an energy decomposition theorem describing the whole space of all optimal positional strategies in terms of so-called e...
متن کاملA Metric for Positional Games
We deene an extended real-valued metric, , for positional games and prove that this class of games is a topological semigroup. We then show that two games are nitely separated ii they are path-connected and ii two closely related Conway games are equivalent. If two games are at a nite distance then this distance is bounded by the maximum diierence of any two atoms found in the games. We may imp...
متن کاملPositional games on graphs THESIS SUBMITTED FOR THE DEGREE OF DOCTOR OF PHILOSOPHY by
The theory of Positional Games is an exciting and relatively young area of Combinatorics, though its origins can be traced back to Classical Game Theory. Its goal is to give a mathematical framework for analyzing games of thought. Positional games are strongly related to several other branches of Combinatorics such as Ramsey Theory, Extremal Graph and Set Theory and the Probabilistic Method. Th...
متن کاملPositional Determinacy of Games with Infinitely Many Priorities
We study two-player games of infinite duration that are played on finite or infinite game graphs. A winning strategy for such a game is positional if it only depends on the current position, and not on the history of the play. A game is positionally determined if, from each position, one of the two players has a positional winning strategy. The theory of such games is well studied for winning c...
متن کامل